#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int n,defeat,victory;
int a[N];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    int l=1,r=1;
    while(l<=r&&l<=n&&r<=n)
    {
        while(a[r]<=a[l]&&r<=n)r++;
        while(a[l]<a[r]&&l<=r&&l<=n&&r<=n)
        {
            defeat++;
            l++;
            r++;
        }
    }
    printf("%d",max(n-defeat,2));
    return 0;
}
